Towards Automatic Convergence Verification of Self-stabilizing Algorithms
نویسندگان
چکیده
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorithms. In this paper, we show how for a certain subclass of dynamic systems – namely piecewise affine hybrid systems – and distributed algorithms suitable to be modeled in terms of these dynamic systems, a proof of convergence can be obtain fully automatically. Together with some additional non-automated arguments, the complete proof of self-stabilization can be derived.
منابع مشابه
Empire of Colonies: Self-stabilizing and Self-organizing Distributed Algorithms
Self-stabilization ensures automatic recovery from an arbitrary state; we define self-organization as a property of algorithms which display local attributes. More precisely, we say that an algorithm is self-organizing if (1) it converges in sublinear time and (2) reacts “fast” to topology changes. If s(n) is an upper bound on the convergence time and d(n) is an upper bound on the convergence t...
متن کاملMechanical Verification of Self-Stabilizing Distributed Systems
Self-stabilizing distributed systems are a class of distributed systems which converge to correct system states even if they start from arbitrary system states. A self-stabilizing system can recover from finite number of transient faults (e.g., message loss, memory corruption). Therefore, they are fault-tolerant systems. When we design a self-stabilizing system, its verification, such as conver...
متن کاملA Byzantine-Fault Tolerant Self-stabilizing Protocol for Distributed Clock Synchronization Systems
Embedded distributed systems have become an integral part of safetycritical computing applications, necessitating system designs that incorporate fault tolerant clock synchronization in order to achieve ultra-reliable assurance levels. Many efficient clock synchronization protocols do not, however, address Byzantine failures, and most protocols that do tolerate Byzantine failures do not self-st...
متن کاملComputer Science Technical Report Swarm Synthesis of Convergence for Symmetric Protocols
Due to their increasing complexity, today’s distributed systems are subject to a variety of transient faults (e.g., loss of coordination, soft errors, bad initialization), thereby making self-stabilization a highly important property of such systems. However, designing Self-Stabilizing (SS) network protocols is a complex task in part because a SS protocol should recover to a set of legitimate s...
متن کاملA New Verification Technique for Self-Stabilizing Distributed Algorithms based on Variable Structure Systems and Ljapunov Theory
A particularly suitable design strategy for constructing a robust distributed computer application is to endow it with a self-stabilization property. Such a property guarantees that the system will always return to and stay within a specified set of legal states within bounded time regardless of its initial state. A self-stabilizing application therefore has the potential of recovering from the...
متن کامل